Verification of Complex Computer Systems »
نویسندگان
چکیده
The computing power of computers, which has doubled every eighteen months since 1975, is now so huge that it is possible to embed very large and extremely sophisticated software in ever more complex systems, from small devices to large-scale, interconnected, distributed, real-time systems. This includes the most highly mission-critical and safetycritical computer-based infrastructures, as produced by the aerospace, automotive, customer electronics, defense, energy, industrial automation, medical device, rail transportation and telecommunication industries. The exponential expansion of software in all application domains leads to the unfortunate situation where software engineers can build increasingly large software, but are less and less confident in the quality of the software they produce. Defaults in such complex software are not so uncommon, as can be experienced everyday by computer end-users. Such bugs can have catastrophic consequences as the most famous, and certainly most costly one, to date, the overflow at the origin of the failure of the Ariane 5.01 flight on 4 June 1996. Because present-day software engineering, which is almost exclusively manual, with very few useful automated tools does not scale up, a grand challenge is therefore to develop knowledge, methods, technologies and tools to master software complexity. ,Minta Martin Lecture, MIT, May 13, 2005 — 2 — ľ P. Cousot Mathematical results show that the automatic software verification problem is indeed extremely hard. Recent progress in the rigorous analysis of software and embedded systems has been possible thanks to abstract interpretation, formalizing the idea of sound approximation of complex mathematical structures, in particular those involved in the semantic models of computer systems. Abstract interpretation can be applied to the systematic construction of methods and effective algorithms to approximate undecidable or very complex problems in computer science such that the semantics, the proof, the static analysis, the verification, the safety and security of software and hardware computer systems. Abstract interpretation-based static analysis, which automatically infers dynamic properties of computer systems, has been very successfully applied in recent years to automatically verify complex properties of real-time, safety critical, embedded systems, such as the verification of absence of runtime errors in the primary flight control software of commercial airplanes. ,Minta Martin Lecture, MIT, May 13, 2005 — 3 — ľ P. Cousot The slides will be available after the lecture. ,Minta Martin Lecture, MIT, May 13, 2005 — 3 — ľ P. Cousot
منابع مشابه
Safety Verification of Real Time Systems Serving Periodic Devices
In real-time systems response to a request from a controlled object must be correct and timely. Any late response to a request from such a device might lead to a catastrophy. The possibility of a task overrun, i.e., missing the deadline for completing a requested task, must be checked and removed during the design of such systems. Safe design of real-time systems running periodic tasks under th...
متن کاملFormal Method in Service Composition in Heath Care Systems
One of the areas with greatest needs having available information at the right moment and with high accuracy is healthcare. Right information at right time saves lives. Healthcare is a vital domain which needs high processing power for high amounts of data. Due to the critical and the special characteristics of these systems, formal methods are used for specification, description and verificati...
متن کاملModeling and Evaluation of Stochastic Discrete-Event Systems with RayLang Formalism
In recent years, formal methods have been used as an important tool for performance evaluation and verification of a wide range of systems. In the view points of engineers and practitioners, however, there are still some major difficulties in using formal methods. In this paper, we introduce a new formal modeling language to fill the gaps between object-oriented programming languages (OOPLs) us...
متن کاملModeling and Evaluation of Stochastic Discrete-Event Systems with RayLang Formalism
In recent years, formal methods have been used as an important tool for performance evaluation and verification of a wide range of systems. In the view points of engineers and practitioners, however, there are still some major difficulties in using formal methods. In this paper, we introduce a new formal modeling language to fill the gaps between object-oriented programming languages (OOPLs) us...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملDecentralized prognosis of fuzzy discrete-event systems
This paper gives a decentralized approach to the problem of failure prognosis in the framework of fuzzy discrete event systems (FDES). A notion of co-predictability is formalized for decentralized prognosis of FDESs, where several local agents with fuzzy observability rather than crisp observability are used in the prognosis task. An FDES is said to be co-predictable if each faulty event can be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005